NL is not equal to NP and NP is not equal to EXPTIME
نویسنده
چکیده
In this paper we show that the quantified Boolean formula problem can be solved in polynomial time by an alternating Turing machine with 2 alternations, if in Boolean formula there exist no more than order of logarithm clauses in which all variables with the existential quantifier.
منابع مشابه
The Complexity of Deterministically Observable Finite-Horizon Markov Decision Processes
We consider the complexity of the decision problem for diierent types of partially-observable Markov decision processes (MDPs): given an MDP, does there exist a policy with performance > 0? Lower and upper bounds on the complexity of the decision problems are shown in terms of completeness for NL, P, NP, PSPACE, EXP, NEXP or EXPSPACE, dependent on the type of the Markov decision process. For se...
متن کاملThe complexity of unobservable nite - horizon Markov decision processes
Markov Decision Processes (MDPs) model controlled stochastic systems. Like Markov chains, an MDP consists of states and probabilistic transitions; unlike Markov chains, there is assumed to be an outside controller who chooses an action (with its associated transition matrix) at each step of the process, according to some strategy or policy. In addition, each state and action pair has an associa...
متن کاملMeasure, Stochasticity, and the Density of Hard Languages
Ogiwara and Watanabe have recently shown that the hypothesis P not equal NP implies that no (polynomially) sparse language is polynomial-time btt-hard for NP. Their technique does not appear to allow significant relaxation of either the query bound or the sparseness criterion. It is shown here that a stronger hypothesis --namely, that NP does not have measure 0 in exponential time --implies the...
متن کاملIAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 5: The Landscape of Complexity Classes
The inclusions L ⊆ NL and P ⊆ NP are trivial since deterministic machines can be viewed as special kinds of nondeterministic machines. The equality PSPACE = NPSPACE is a consequence of Savitch’s Theorem and the inclusion NL ⊆ P can also be obtained by that same idea of reducing to graph reachability. The fact that EXP contains PSPACE, and therefore NPSPACE, was pointed out just before the proof...
متن کاملP is not equal to NP
A new axiom of Turing’s theory of computing is used to prove that SAT is not in P. Thus, P is not equal to NP, follows directly. A computeroriented version verifies the results, elsewhere, using a theorem-prover.
متن کامل